#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <list>
#include <memory>

using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

struct ListNode {
    int val;
    ListNode *next;
    ListNode() : val(0), next(nullptr) {}
    ListNode(int x) : val(x), next(nullptr) {}
    ListNode(int x, ListNode *next) : val(x), next(next) {}
};

void printStrArr(vector<string>& strs) {
    for (auto str : strs) {
        cout << str << "\t";
    }
    cout << endl;
}

void printArray(vector<vector<int>>& nums) {
    for (int i = 0; i < nums.size(); i++) {
        for (int n : nums[i]) {
            cout << n << "\t";
        }
        cout << endl;
    }
}


int main(int argc, char const *argv[]) {
    printf("liushibo");
    
    return 0;
}

